Achieving faster failure detection in OSPF networks

نویسندگان

  • Mukul Goyal
  • K. K. Ramakrishnan
  • Wu-chi Feng
چکیده

With the current default settings of the OSPF parameters, the network takes several tens of seconds before recovering from a failure. The main component in this delay is the time required to detect the failure using Hello protocol. Failure detection time can be speeded up by reducing the value of HelloInterval. However, too small a value of HelloInterval will result in an increased chance of network congestion causing loss of several consecutive Hellos, thus leading to false breakdown of adjacency between routers. Such false alarms not only disrupt network traffic by causing unnecessary routing changes but also increase the processing load on the routers which may potentially lead to routing instability. In this paper, we investigate the following question What is the optimal value for the HelloInterval that will lead to fast failure detection in the network while keeping the false alarm occurrence within acceptable limits? We examine the impact of both network congestion and the network topology on the optimal HelloInterval value. Additionally, we investigate the effectiveness of faster failure detection in achieving faster failure recovery in OSPF networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Study on a Fast OSPF Route Reconstruction Method under Network Failures

OSPF (Open Shortest Path First), which is used widely on networks, has a Router Dead Interval problem. If a (backup) designated router has stopped operation due to failure, the OSPF routers await a hello packet acknowledgment for the router dead interval to recognize that the designated router has ceased the operation. The Router Dead Interval is 40 sec This interval time is not only long for m...

متن کامل

Design and Implementation of High Availability OSPF Router

In this paper, we propose a High Availability Open Shortest Path First (HA-OSPF) router which consists of two OSPF router modules, active and standby, to support a high availability network. First, we used the continuous-time Markov chain (CTMC) to analyze the steady-state availability of an HA-OSPF router with one active router and N standby routers (1 + N redundancy model). Then, with the fai...

متن کامل

MPLS Protection Switching Versus OSPF Rerouting: A Simulative Comparison

Resilience is becoming a key design issue for future IP-based networks having a growing commercial importance. In the case of element failures the networks have to reconfigure in the order of a few hundred milliseconds, i.e. much faster than provided by the slow rerouting of current implementations. Several multi-path extensions to IP and timer modifcations have been recently proposed providing...

متن کامل

A Study on the Impact of Multiple Failures on OSPF Convergence

Open Shortest Path First (OSPF) is a popular link state routing protocol widely used in Internet infrastructure. OSPF implements several timers to limit the protocol overhead. With these timers, it usually takes several tens of seconds for OSPF network to recover from a failure. The convergence time is delayed mainly by the timers of failure detection and routing calculation scheduling. In this...

متن کامل

Improving Network Convergence Time and Network Stability of an OSPF-Routed IP Network

The loss of routing protocol control messages due to network congestion can cause peer failures in routers, leading to routing failures and network instability. We attempt to decrease the network convergence time in response to a node or link failure in a network and study its implications on network stability. We develop an algorithm to dynamically tune OSPF failure threshold based on the netw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003